Efficient Implementation of Arithmetic Operations in ECC over Binary Fields
نویسنده
چکیده
In this paper the implementation of arithmetic operations in ECC is described.Elliptic curve cryptography is very useful in the field of the network security because of its small key size and its high strength of security.In this paper briefly describing general arithmetic operations we focus on scalar multiplication . We present two techniques: (i)reducing Hamming weight of scalars in binary representation and (ii) using sliding window , for obtatining scalar multiplication in a faster manner. Use of both the techniques is explained by suitable examples.
منابع مشابه
Architectures for Arithmetic Operations in Gf(2m) Using Polynomial and Normal Basis for Elliptic Curve Cryptosystems
Elliptic Curve Cryptography (ECC) fits well for an efficient and secure encryption scheme. It is efficient than the ubiquitous RSA based schemes because ECC utilizes smaller key sizes for equivalent security. This feature of ECC enables it to be applied to Wireless networks where there are constraints related to memory and computational power. Fast and high-performance computation of finite fie...
متن کاملA Simple Architectural Enhancement for Fast and Flexible Elliptic Curve Cryptography over Binary Finite Fields GF(2m)
Mobile and wireless devices like cell phones and networkenhanced PDAs have become increasingly popular in recent years. The security of data transmitted via these devices is a topic of growing importance and methods of public-key cryptography are able to satisfy this need. Elliptic curve cryptography (ECC) is especially attractive for devices which have restrictions in terms of computing power ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملGeneric GF(2) Arithmetic in Software and Its Application to ECC
This work discusses generic arithmetic for arbitrary binary fields in the context of elliptic curve cryptography (ECC). ECC is an attractive public-key cryptosystem recently endorsed by the US government for mobile/wireless environments which are limited in terms of their CPU, power, and network connectivity. Its efficiency enables constrained, mobile devices to establish secure end-to-end conn...
متن کاملArea-efficient VLSI implementation of arithmetic operations in binary finite fields GF( )
This paper presents a bit-serial architecture for efficient addition and multiplication in binary finite fields GF( ) using a polynomial basis representation. Moreover, a low-power implementation of the arithmetic circuits and the registers is proposed. The introduced multiplier operates over a wide range of binary finite fields up to an order of . It is detailed that the bit-serial multiplier ...
متن کامل